Existence of Forbidden Digraphs for Crisp Boolean Petri Nets
نویسندگان
چکیده
منابع مشابه
Existence and Uniqueness of a Minimum Crisp Boolean Petri Net
In the continuing research towards characterizing 1-safe Petri nets with n-places and generating all the 2n binary n-vectors as marking vectors exactly once, the problem of determine minimum Petri nets; 'minimum' in the sense that the number of transitions is kept minimum possible for the generation of all the 2n binary n-vectors has been found. In this paper, the existence and unique...
متن کاملConstruction of a Crisp Boolean Petri Net from a 1-safe Petri Net
The concept of a Petri net, a tool for the study of certain discrete dynamical systems, was invented in 1939 by Carl Adam Petri. In the attempt to characterize Boolean Petri nets, we discovered a subclass of Boolean Petri net called the crisp Boolean Petri net, viz. , the one that generates every binary vector as its marking vectors exactly once. In this paper, the construction of a crisp Boole...
متن کاملOn the Problem of Characterizing Boolean Petri Nets
Petri nets are used for describing, designing and studying discrete event-driven systems that are characterized as being concurrent, asynchronous, distributed, parallel, and/or nondeterministic. As a graphical tool, Petri net can be used for planning and designing a system with given objectives, more effectively than flowcharts and block diagrams. As a mathematical tool, it enables one to set u...
متن کاملOptimal Control of Asynchronous Boolean Networks Modeled by Petri Nets
A Boolean network model is one of the models of gene regulatory networks, and is widely used in analysis and control. Although a Boolean network is a class of discrete-time nonlinear systems and expresses the synchronous behavior, it is important to consider the asynchronous behavior. In this paper, using a Petri net, a new modeling method of asynchronous Boolean networks with control inputs is...
متن کاملExistence of home states in Petri nets is decidable
We show that the problem whether a given Petri net has a home state (a marking reachable from every reachable marking) is decidable, and at least as hard as the reachability problem.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Mathematical, Engineering and Management Sciences
سال: 2019
ISSN: 2455-7749
DOI: 10.33889/ijmems.2020.5.1.008